GATE CSE 2016 SET-1
Q21.
Two eigen values of a 3x3 real matrix P are (2+\sqrt{-1}) and 3.The determinantof P is __________.Q23.
The following function computes the maximum value contained in an integer array p[] of size n (n>=1). int max(int*p, int n){ int a=0,b=n-1; while (__________){ if (p[a]<=p[b]){a=a+1;} else {b=b-1;} } return p[a]; } The missing loop condition isQ24.
Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one level page table per process and each page table entry requires 48 bits, then the size of the per-process page table is _________ mega bytes.Q25.
Consider a computer system with ten physical page frames. The system is provided with an accessse quence (a_{1},a_{2},...,a_{20},a_{1},a_{2},...,a_{20}), where each a_{i} is a distinct virtual page number. The difference in the number of page faults between the last-in-first-outpage replacement policy and the optimal page replacement policy is ______.Q26.
A processor can support a maximum memory of 4GB, where the memory is word-addressable (a word consists of two bytes). The size of the address bus of the process or is at least bits________.Q27.
Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1,2,3,4,5, and 6. The maximum possible weight that a minimum weight spanning tree of G can haveis .Q28.
Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is increasedby the same value ,then which of the following statements is/are TRUE? P: Minimum spanning tree of G does not change Q: Shortest path between any pair of vertices does not changeQ29.
G = (V,E) is an undirected simple graph in which each edge has a distinct weight,and e is a particular edgeof G. Which of the following statements about the minimum spanning trees (MSTs) of G is/are TRUE? I. If e is the lightest edge of some cycle in G, then every MST of G includes e II. If e is the heaviest edge of some cycle in G, then every MST of G excludes eQ30.
Consider that B wants to send a message m that is digitally signed to A. Let the pair of private and public keys for A and B be denoted by K_{x}^{-} and K_{x}^{+} for x = A,B, respectively. Let K_{x}(m) represent the operation of encrypting m with a key K_{x} and H(m) represent the message digest. Which one of the following indicates the CORRECT way of sending the message m along with the digital signature to A?